Effects of Papoulis-Gerchberg Iterative Scheme with Real Orthogonal Transform for Signal Reconstruction
نویسنده
چکیده
The iterative algorithm of Papoulis-Gerchberg is simple and efficient solution to signal reconstruction problem. However, the PG algorithm is usually slowly convergent, and a band-limited signal practically is difficult to be obtained. In this work, we present and discuss an innovative approach for restoring lost data with a specific preprocess for meeting boundary conditions of real orthogonal transforms in an iteration methodology. The simulation indicates that a better mean square error of the reconstruction and a faster convergence rate can be obtained if the proposed preprocess concept is adapted.
منابع مشابه
Mathematics for Multimedia Signal Processing II: Discrete Finite Frames and Signal Reconstruction
Certain signal reconstruction problems can be understood in terms of frames and redundant representations. The redundancy is useful because it leads to robust signal representations, that is, representations in which partial loss of data can be tolerated without misbehavior or adverse effects. This chapter begins by presenting a few engineering problems in which robust data representations play...
متن کاملAn iterative algorithm for computed tomography image reconstruction from limited-angle projections
In application of tomography imaging, limited-angle problem is a quite practical and important issue. In this paper, an iterative reprojection-reconstruction (IRR) algorithm using a modified Papoulis-Gerchberg (PG) iterative scheme is developed for reconstruction from limited-angle projections which contain noise. The proposed algorithm has two iterative update processes, one is the extrapolati...
متن کاملThe Papoulis-Gerchberg Algorithm with Unknown Signal Bandwidth
The Papoulis-Gerchberg algorithm has been extensively used to solve the missing data problem in band-limited signals. The interpolation of low-pass signals with this algorithm can be done if the signal bandwidth is known. In practice, the signal bandwidth is unknown and has to be estimated by the user, preventing an automatic application of the Papoulis-Gerchberg algorithm. In this paper, we pr...
متن کاملModified Papoulis-Gerchberg algorithm for sparse signal recovery
Motivated by the well-known Papoulis-Gerchberg algorithm, an iterative thresholding algorithm for recovery of sparse signals from few observations is proposed. The sequence of iterates turns out to be similar to that of the thresholded Landweber iterations, although not the same. The performance of the proposed algorithm is experimentally evaluated and compared to other state-of-the-art methods.
متن کاملFerreira : Interpolation and the Discrete Papoulis - Gerchberg Algorithm
| In this paper we analyze the performance of an iterative algorithm, similar to the discrete Papoulis-Gerchberg algorithm, and which can be used to recover missing samples in nite-length records of band-limited data. No assumptions are made regarding the distribution of the missing samples, in contrast with the often studied extrapolation problem, in which the known samples are grouped togethe...
متن کامل